Logics of Domains

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Logics with Concrete Domains

In this paper we present the hybrid logic HLC(@, ↓), an extension of HL(@, ↓), whose models have a concrete domain (such as the natural or real numbers). This logic extends the language of HL(@, ↓) including terms with equality to deal with concrete domain values. Similar languages have already been investigated in other areas like knowledge representation (e.g., description logics with concret...

متن کامل

Description Logics with Concrete Domains and Aggregation

We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max; count; sum), which are usually available in database systems. On the one hand, we show that this extension may lead to undecidability of the basic inference problems satisfiability and subsumption. This is true even for a very small Descriptio...

متن کامل

Towards Log-Linear Logics with Concrete Domains

We present MEL (M denotes Markov logic networks) an extension of the log-linear description logics EL-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent EL ontology from an MEL knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending M...

متن کامل

Description Logics with Fuzzy Concrete Domains

We present a fuzzy version of description logics with concrete domains. Main features are: (i) concept constructors are based on t-norm, t-conorm, negation and implication; (ii) concrete domains are fuzzy sets; (iii) fuzzy modifiers are allowed; and (iv) the reasoning algorithm is based on a mixture of completion rules and bounded mixed integer programming.

متن کامل

Multi-valued Logics, Effectiveness and Domains

Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machines and fuzzy grammar given in literature is also investigated. This shows the inadequateness of these definitions and the difficulties in formulating an analogue of Church Thesis for fuzzy logic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DAIMI Report Series

سال: 1989

ISSN: 2245-9316,0105-8517

DOI: 10.7146/dpb.v18i298.6692